A class of linear solvers built on the Biconjugate A-Orthonormalization Procedure for solving unsymmetric linear systems

摘要

We present economical iterative algorithms built on the Biconjugate$A$-Orthonormalization Procedure for real unsymmetric and complex non-Hermitiansystems. The principal characteristics of the developed solvers is that theyare fast convergent and cheap in memory. We report on a large combination ofnumerical experiments to demonstrate that the proposed family of methods ishighly competitive and often superior to other popular algorithms built uponthe Arnoldi method and the biconjugate Lanczos procedures for unsymmetriclinear sytems.